منابع مشابه
Quantum deduction rules (preliminary version)
We define propositional quantum Frege proof systems and compare it with classical Frege proof systems.
متن کاملDeduction Schemes for Association Rules
Several notions of redundancy exist for Association Rules. Often, these notions take the form “any dataset in which this first rule holds must obey also that second rule, therefore the second is redundant”; if we see datasets as interpretations (or models) in the logical sense, this is a form of logical entailment. In many logics, entailment has a syntactic counterpart in the form of a deductio...
متن کاملEnhancing Partial Deduction via Unfold/Fold Rules
We show that sometimes partial deduction produces poor program specializations because of its limited ability in (i) dealing with conjunctions of recursively deened predicates, (ii) combining partial evaluations of alternative computations, and (iii) taking into account unii-cation failures. We propose to extend the standard partial deduction technique by using versions of the deenition rule an...
متن کاملFrom Gabbay-style rules to labelled deduction
Is there a link between Gabbay-style rules, modal languages with nominals, and labelled deduction? It seems there should be: though they differ in many ways, all share the idea that state-names are important in modal deduction. I shall show how to move from a Gabbay-style rule to labelled deduction via the basic hybrid language. I finish with a discussion of the place of state-names in modal lo...
متن کاملDeriving Natural Deduction Rules from Truth Tables
We develop a general method for deriving natural deduction rules from the truth table for a connective. The method applies to both constructive and classical logic. This implies we can derive “constructively valid” rules for any (classical) connective. We show this constructive validity by giving a general Kripke semantics, that is shown to be sound and complete for the constructive rules. For ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2009
ISSN: 0168-0072
DOI: 10.1016/j.apal.2008.09.017